"Computing Densities: A Conditional Monte Carlo Estimator"

We propose a generalized conditional Monte Carlo technique for computing densities in economic models. Global consistency and functional asymptotic normality are established under ergodicity assumptions on the simulated process. The asymptotic normality result allows us to characterize the asymptotic distribution of the error in density space, and implies faster convergence than nonparametric kernel density estimators. We show that our results nest several other well-known density estimators, and illustrate potential applications.

Computing Densities: A Conditional Monte Carlo Estimator

We propose a generalized conditional Monte Carlo technique for computing densities in economic models. Global consistency and functional asymptotic normality are established under ergodicity assumptions on the simulated process. The asymptotic normality result allows us to characterize the asymptotic distribution of the error in density space, and implies faster convergence than nonparametric kernel density estimators. We show that our results nest several other well-known density estimators, and illustrate potential applications.

"Computing Densities and Expectations in Stochastic Recursive Economies: Generalized Look-Ahead Techniques"

We propose a generalized look-ahead estimator for computing densities and expectations in economic models. We provide conditions under which the estimator converges globally with probability one, and exhibit the asymptotic distribution of the error. Our estimator is more efficient than other Monte Carlo based approaches. Numerical experiments indicate that the estimator can provide large increases in accuracy and speed relative to traditional methods. Particular applications we consider are the stochastic growth model and an income fluctuation problem.

Generalized Look-Ahead Methods for Computing Stationary Densities

The look-ahead estimator is used to compute densities associated with Markov processes via simulation. We study a framework that extends the look-ahead estimator to a much broader range of applications. We provide a general asymptotic theory for the estimator, where both L1 consistency and L2 asymptotic normality are established.

A Network Resource Allocation Recommendation Method with An Improved Similarity Measure

Recommender systems have been acknowledged as efficacious tools for managing information overload. Nevertheless, conventional algorithms adopted in such systems primarily emphasize precise recommendations and, consequently, overlook other vital aspects like the coverage, diversity, and novelty of items. This approach results in less exposure for long-tail items. In this paper, to personalize the recommendations and allocate recommendation resources more purposively, a method named PIM+RA is proposed. This method utilizes a bipartite network that incorporates self-connecting edges and weights. Furthermore, an improved Pearson correlation coefficient is employed for better redistribution. The evaluation of PIM+RA demonstrates a significant enhancement not only in accuracy but also in coverage, diversity, and novelty of the recommendation. It leads to a better balance in recommendation frequency by providing effective exposure to long-tail items, while allowing customized parameters to adjust the recommendation list bias

Financing Sources, R&D Investment and Enterprise Risk

AbstractResearch and development (R&D) investment of high-tech enterprises has an impact on enterprise risk, but the effect is different when funding sources are different. This paper aims to study the relationships among financing sources, R&D investment and enterprise risk. The empirical results suggest that the relationship between endogenous financing rate and R&D investment is significantly positive, and asset-liability ratio has a significantly negative impact on R&D investment. Furthermore, the study shows that relationship between enterprise risk and R&D investment can be described with a quadratic parabola

Evaluation of machine learning algorithms for anomaly detection

Malicious attack detection is one of the critical cyber-security challenges in the peer-to-peer smart grid platforms due to the fact that attackers' behaviours change continuously over time. In this paper, we evaluate twelve Machine Learning (ML) algorithms in terms of their ability to detect anomalous behaviours over the networking practice. The evaluation is performed on three publicly available datasets: CICIDS-2017, UNSW-NB15 and the Industrial Control System (ICS) cyber-attack datasets. The experimental work is performed through the ALICE high-performance computing facility at the University of Leicester. Based on these experiments, a comprehensive analysis of the ML algorithms is presented. The evaluation results verify that the Random Forest (RF) algorithm achieves the best performance in terms of accuracy, precision, Recall, F1-Score and Receiver Operating Characteristic (ROC) curves on all these datasets. It is worth pointing out that other algorithms perform closely to RF and that the decision regarding which ML algorithm to select depends on the data produced by the application system